THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
نویسندگان
چکیده
منابع مشابه
Formula Size Lower Bounds and Quantum States
Everyone agrees that building a quantum computer is hard. But some people think it must be impossible for a fundamental physical reason. Two computer scientists who think this are Leonid Levin and Oded Goldreich. Levin, for example, says that the exponentially small amplitudes that arise in Shor’s factoring algorithm are absurd—that they take us far beyond quantum mechanics’ regime of demonstra...
متن کاملAdversary Lower Bounds for Nonadaptive Quantum Algorithms
We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
متن کاملOptimal Quantum Adversary Lower Bounds for Ordered Search
The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Høyer, Neerbek, and Shi proved a quantum lower bound for this problem of 1 π lnn + Θ(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the origina...
متن کاملBreaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, which gives a formula size lower bound by showing a feasible solution of the dual problem of its LP-relaxation. As extensions of the LP bound, we introduce novel general techniques proving formula size lower bounds, name...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2006
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-006-0212-7